Connectionist learning of regular graph grammars
نویسندگان
چکیده
منابع مشابه
Connectionist learning of regular graph grammars
This paper presents a new connectionist approach to grammatical inference. Using only positive examples, the algorithm learns regular graph grammars, representing two-dimensional iterative structures drawn on a discrete Cartesian grid. This work is intended as a case study in connectionist symbol processing and geometric conceptformation. A grammar is represented by a self-configuring connectio...
متن کاملRegular Rooted Graph Grammars
This thesis investigates a pragmatic approach to typing, static analysis and static optimization of Web query languages, in special the Web query language Xcerpt[43]. The approach is pragmatic in the sense, that no restriction on the types are made for decidability or efficiency reasons, instead precision is given up if necessary. Pragmatics on the dynamic side means to use types not only to en...
متن کاملLearning Graph Grammars
Discovery of patterns in a given graph in the form of repeated subgraphs is useful in finding a concise representation of the graph, as well as identifying objects of interest to the overlying application. In many application scenarios of practical significance, available background knowledge can lead to an extension of a subgraph discovery algorithm to infer general grammar rules of a language...
متن کاملParsing Graphs with Regular Graph Grammars
Recently, several datasets have become available which represent natural language phenomena as graphs. Hyperedge Replacement Languages (HRL) have been the focus of much attention as a formalism to represent the graphs in these datasets. Chiang et al. (2013) prove that HRL graphs can be parsed in polynomial time with respect to the size of the input graph. We believe that HRL are more expressive...
متن کاملDesigning and Learning Substitutable Plane Graph Grammars
Though graph grammars have been widely investigated for 40 years, few learning results exist for them. The main reasons come from complexity issues that are inherent when graphs, and a fortiori graph grammars, are considered. The picture is however different if one considers drawings of graphs, rather than the graphs themselves. For instance, it has recently been proved that the isomorphism and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Connection Science
سال: 2001
ISSN: 1360-0494,0954-0091
DOI: 10.1080/09540090110072327